A Group-Oriented Generalized Secret Sharing Scheme with Cheater Detection
نویسندگان
چکیده
The generalized secret sharing scheme is a method used to divide secret into a set of participants such that only the qualified subsets of participants can reconstruct the secret. In this paper, we first propose a new generalized secret sharing scheme with cheater detection. The security of the scheme is based on discrete logarithm problem. Based on this scheme, we present a group-oriented generalized secret sharing scheme which provides senders an approach to distribute message to specific groups securely. The advantage of this scheme is that the sender need not to distribute secret information to all participants of the intended groups, and cheaters can also be detected. Indexing terms: secret sharing scheme, generalized secret sharing scheme, group-oriented cryptosystem, cheater detection. 國立虎尾技術學院學報 第四期(民國90年)179〜185
منابع مشابه
An Efficient Threshold Verifiable Multi-Secret Sharing Scheme Using Generalized Jacobian of Elliptic Curves
In a (t,n)-threshold secret sharing scheme, a secret s is distributed among n participants such that any group of t or more participants can reconstruct the secret together, but no group of fewer than t participants can do. In this paper, we propose a verifiable (t,n)-threshold multi-secret sharing scheme based on Shao and Cao, and the intractability of the elliptic curve discrete logar...
متن کاملDesign of Reliable and Secure Devices Realizing Shamir's Secret Sharing
Shamir’s secret sharing scheme is an effective way to distribute secret to a group of shareholders. The security of the unprotected sharing scheme, however, can be easily broken by cheaters or attackers who maliciously feed incorrect shares during the secret recovery stage or inject faults into hardware computing the secret. In this paper, we propose cheater detection and identification schemes...
متن کاملCheating Detection and Cheater Identification in CRT-based Secret Sharing Schemes
In this paper we analyze the cheating detection and cheater identification problems for the secret sharing schemes based on the Chinese remainder theorem (CRT ), more exactly for Mignotte [1] and Asmuth-Bloom [2] schemes. We prove that the majority of the solutions for Shamir’s scheme [3] can be translated to these schemes and, moreover, there are some interesting specific solutions.
متن کاملAn Efficient t-Cheater Identifiable Secret Sharing Scheme with Optimal Cheater Resiliency
In this paper, we present an efficient k-out-of-n secret sharing scheme, which can identify up to t rushing cheaters, with probability at least 1 − , where 0 < < 1/2, provided t < k/2. This is the optimal number of cheaters that can be tolerated in the setting of public cheater identification, on which we focus in this work. In our scheme, the set of all possible shares Vi satisfies the conditi...
متن کاملUniversal Construction of Cheater-Identifiable Secret Sharing Against Rushing Cheaters without Honest Majority
For conventional secret sharing, if cheaters can submit possibly forged shares after observing shares of the honest users in the reconstruction phase, they can disturb the protocol and reconstruct the true secret. To overcome the problem, secret sharing scheme with properties of cheater-identification have been proposed. Existing protocols for cheater-identifiable secret sharing assumed non-rus...
متن کامل